Distinct distances between points and lines
نویسندگان
چکیده
We show that for m points and n lines in R2, the number of distinct distances between the points and the lines is Ω(m1/5n3/5), as long as m1/2 ≤ n ≤ m2. We also prove that for any m points in the plane, not all on a line, the number of distances between these points and the lines that they span is Ω(m4/3). The problem of bounding the number of distinct point-line distances can be reduced to the problem of bounding the number of tangent pairs among a finite set of lines and a finite set of circles in the plane, and we believe that this latter question is of independent interest. In the same vein, we show that n circles in the plane determine at most O(n3/2) points where two or more circles are tangent, improving the previously best known bound of O(n3/2 log n). Finally, we study three-dimensional versions of the distinct point-line distances problem, namely, distinct point-line distances and distinct point-plane distances. The problems studied in this paper are all new, and the bounds that we derive for them, albeit most likely not tight, are non-trivial to prove. We hope that our work will motivate further studies of these and related problems.
منابع مشابه
Distinct Distances Between Sets of Points on a Line and a Hyperplane in R
A variant of Erdős’s distinct distances problem considers two sets of points in Euclidean space P1 and P2, both of cardinality n, and asks whether we can find a superlinear bound on the number of distinct distances between all pairs of points with one in P1 and the other in P2. In 2013, Sharir, Sheffer, and Solymosi [8] showed a lower bound of Ω(n) when P1 and P2 are both collinear point sets i...
متن کاملFew distinct distances implies no heavy lines or circles
We study the structure of planar point sets that determine a small number of distinct distances. Specifically, we show that if a set P of n points determines o(n) distinct distances, then no line contains Ω(n) points of P and no circle contains Ω(n) points of P . We rely on the bipartite and partial variant of the Elekes-Sharir framework that was presented by Sharir, Sheffer, and Solymosi in [2...
متن کاملAdaptation of Structured Grid for Supersonic and Transonic Flows
Two distinct redistribution grids - adaptation techniques, spring analogy and elliptic grid generator are applied to two-dimensional steady, inviscid, shocked flows, and the ability of each technique is examined and compared. Euler equations are solved base on Roe's Reimann solver approach to simulate supersonic flow around a sphere, transonic flow about an airfoil and supersonic flow in a symm...
متن کاملA De Bruijn-Erdős Theorem for Asteroidal-Triple Free Graphs∗
A classical result of De Bruijn and Erdős shows that any given n points are either collinear or determine at least n distinct lines in the plane. Chen and Chvátal conjectured that a generalization of this result in all metric spaces, with appropriate definitions of lines, holds as well. In this note, we show that the Chen-Chvátal generalization holds for Asteroidal-Triple free graphs, where lin...
متن کاملDistinct Distance Estimates and Low Degree Polynomial Partitioning
We give a shorter proof of a slightly weaker version of a theorem fromGuth and Katz (Ann Math 181:155–190, 2015): we prove that if L is a set of L lines in R3 with at most L1/2 lines in any low degree algebraic surface, then the number of r -rich points of L is L(3/2)+εr−2. This result is one of the main ingredients in the proof of the distinct distance estimate in Guth and Katz (2015). With ou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Comput. Geom.
دوره 69 شماره
صفحات -
تاریخ انتشار 2018